Some new Algebraic constructions of Codes from Graphs which are good Expanders∗
نویسندگان
چکیده
The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders. LDPC codes are designed based on the zigzag product graph of two component Cayley graphs. The results for specific cases simulated reveal that the resulting LDPC codes compare well with other random LDPC codes at short block lengths – suggesting that product graphs form yet another avenue to pursue in the design of codes over graphs.
منابع مشابه
Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs
A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is used to obtain new simple explicit constructions of asymptotically good codes. In one of the constructions, the expanders are used to enhance Justesen codes by replicating, shuffling and then regrouping the code coordinates. For any fixed (small) rate, and for sufficiently large alphabet, the codes ...
متن کاملConstruction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is used to obtain new simple explicit constructions of asymptotically good codes. In one of the constructions, the expanders are used to enhance Justesen codes by replicating, shuffling and then regrouping the code coordinates. For any fixed (small) rate, and for sufficiently large alphabet, the codes ...
متن کاملProbabilistic Decoding of Low-Density Cayley Codes
We report on some investigations into the behavior of a class of low-density codes constructed using algebraic techniques. Recent work shows expansion to be an essential property of the graphs underlying the low-density parity-check codes first introduced by Gallager. In addition, it has recently been shown that certain spectral techniques similar to those based on Fourier analysis for classica...
متن کاملConstructions and bounds on linear error-block codes
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over F2. We also study the asymptotic of linear error-block codes. We define the real valued function αq,m,a(δ), which is an analog of the importa...
متن کاملAlgorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes
Expander graphs are highly connected sparse nite graphs. The property of being an expander seems signi cant in many of these mathematical, computational and physical contexts. For practical applications it is very important to construct expander and Ramanujan graphs with given regularity and order. In general, constructions of the best expander graphs with a given regularity and order is no eas...
متن کامل